Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu

Source URL: www.scottaaronson.com

• Computational complexity theory
• Theory of computation
• Complexity classes
• Mathematical optimization
• Structural complexity theory
• Models of computation
• P versus NP problem
• NP
• Reduction
• Time complexity
• Oracle machine
• Low

On the Complexity of Abstract Categorial Grammars In this abstract we investigate the respective complexities of the membership and the universal membership problems for Abstract Categorial Grammars [dG01]. This problem

Source URL: wwwhomes.uni-bielefeld.de

• Logic in computer science
• Theoretical computer science
• Mathematics
• Constructible universe
• Mathematical logic
• CurryHoward correspondence
• Table of stars with Bayer designations
• Generalised Whitehead product

Metaheuristics for Transport and Logistics Andrea E. Rizzoli, IDSIA Luca Maria Gambardella, IDSIA Conference paper STRC 2002

Source URL: www.strc.ch

• Operations research
• Mathematical optimization
• Metaheuristics
• Luca Maria Gambardella
• Search algorithms
• Ant colony optimization algorithms
• Dalle Molle Institute for Artificial Intelligence Research
• Genetic algorithm
• Combinatorial optimization
• Tabu search
• Artificial ants
• Travelling salesman problem

The Determinants of Energy Demand of the Swiss Private Transportation Sector The Multiple Discrete-Continuous Extreme Value Model (MDCEV)______________________________August, 2009 The Determinants of Energy Demand of the

Source URL: www.strc.ch

• Consumer theory
• Economy
• Utility
• Operations research
• Microeconomics
• Economics
• Choice modelling
• Utility maximization problem
• Mathematical optimization
• Economic model
• Preference
• Expected value

POLYA PROBLEM-SOLVING SEMINAR WEEK 4: COMPLEX NUMBERS BOB HOUGH AND RAVI VAKIL The Rules. These are way too many problems to consider. Just pick a few problems you like and play around with them.

Source URL: math.stanford.edu

• Mathematics
• Mathematical analysis
• Special functions
• Analytic functions
• Triangle geometry
• Ratios
• Trigonometric functions
• Trigonometry
• Function
• Triangle
• Sine
• Leibniz integral rule

Generalized Algorithms for Crew Planning: Survey and Future Directions for Railways Viswanathan Prem Kumar Michel Bierlaire Olivier Gallay

Source URL: www.strc.ch

• Operations research
• Business
• Economy
• Mathematics
• Crew scheduling
• Column generation
• Scheduling
• Memetic algorithm
• Schedule
• Nurse scheduling problem
• Mathematical optimization
• Integer programming

Homework problem 0.1 What follows is (what I think is) a very simple algorithm in pseudocode, along with (what I think is) some poorly expressed mathematical explanation. Write it out in literate code, or whatever way yo

Source URL: studentnet.cs.manchester.ac.uk

Metascience:103–106 DOIs11016z BOOK REVIEW Looking for a quantum ontology Detlev Du¨rr and Stefan Teufel: Bohmian mechanics:

Source URL: www.mathematik.uni-muenchen.de

• Quantum measurement
• Interpretations of quantum mechanics
• Randomness
• Quantum mechanics
• Interpretation
• De BroglieBohm theory
• Copenhagen interpretation
• Mathematical formulation of quantum mechanics
• Measurement problem
• Indeterminism
• Introduction to quantum mechanics
• Physics

ALUMNI PROFILE ALUMNI PROFILE Athanassios S. Fokas Professor A. S. Fokas holds the Chair in Nonlinear Mathematical Science at the University of Cambridge in the UK.

Source URL: www.eas.caltech.edu

• Mathematical analysis
• Mathematics
• Guggenheim Fellows
• Athanassios S. Fokas
• California Institute of Technology
• Complex analysis
• Fokas
• RiemannHilbert problem
• Medical imaging
• Israel Gelfand

Curry’s Last Problem: Imitating λ-β-reduction in Combinatory Logic J. Roger Hindley, Mathematics Department, Swansea University, Swansea SA2 8PP, U.K. Email: From talks at Mathematical Logic

Source URL: www.users.waitrose.com